A new algorithm for optimal multileaf collimator field segmentation : Multileaf collimators in radiation therapyENGEL, Konrad.Discrete applied mathematics. 2005, Vol 152, Num 1-3, pp 35-51, issn 0166-218X, 17 p.Article

Testing bandwidth k for k-connected graphsENGEL, Konrad; GUTTMANN, Sven.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 2, pp 301-312, issn 0895-4801, 12 p.Article

Optimal matrix-segmentation by rectanglesENGEL, Konrad.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2015-2030, issn 0166-218X, 16 p.Conference Paper

A New Algorithm for a Field Splitting Problem in Intensity-Modulated Radiation TherapyCHEN, Danny Z; ENGEL, Konrad; CHAO WANG et al.Algorithmica. 2011, Vol 61, Num 3, pp 656-673, issn 0178-4617, 18 p.Article

A generalization of Sperner's theorem and an application to graph orientationsJIANGUO QIAN; ENGEL, Konrad; WEI XU et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2170-2176, issn 0166-218X, 7 p.Conference Paper

Minimal sample databases for global cardinality constraintsENGEL, Konrad; HARTMANN, Sven.Lecture notes in computer science. 2002, pp 268-287, issn 0302-9743, isbn 3-540-43220-5Conference Paper

Optimal Discrete Structures and Algorithms ODSA 2006BRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 2009, Vol 157, Num 9, issn 0166-218X, 241 p.Conference Proceedings

Optimal Discrete Structures and Algorithms (ODSA 2000), Rostock, Germany, September 11-13, 2000BRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 2004, Vol 138, Num 1-2, issn 0166-218X, 254 p.Conference Proceedings

Proceedings of the Conference on Optimal Discrete Structures and Algorithms, ODSA '97, 8-10 September 1997, Rostock, GermanyBRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 1999, Vol 95, Num 1-3, issn 0166-218X, 471 p.Conference Proceedings

Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2BABURIN, A. E; CROCE, F. Della; GIMADI, E. K et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 1988-1992, issn 0166-218X, 5 p.Conference Paper

Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problemsIWASA, Masaru; SAITO, Hiroo; MATSUI, Tomomi et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2078-2088, issn 0166-218X, 11 p.Conference Paper

Intersection models of weakly chordal graphsGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2031-2047, issn 0166-218X, 17 p.Conference Paper

The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluenceKALINOWSKI, Thomas.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2089-2104, issn 0166-218X, 16 p.Conference Paper

The incidence game chromatic numberANDRES, Stephan Dominique.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 1980-1987, issn 0166-218X, 8 p.Conference Paper

Ladder orderings of pairs and RAID performanceCOHEN, Myra B; COLBOURN, Charles J.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 35-46, issn 0166-218X, 12 p.Conference Paper

Completing partial latin squares with prescribed diagonalsGRÜTTMÜLLER, Martin.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 89-97, issn 0166-218X, 9 p.Conference Paper

On k-partitioning of Hamming graphsBEZRUKOV, S. L; ELSÄSSER, R; SCHROEDER, U.-P et al.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 127-140, issn 0166-218XConference Paper

On the PBD-closure of sets containing 3GRÜTTMÜLLER, M.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 251-272, issn 0166-218XConference Paper

On the complexity of linear Programming in the BSS-modelBÄR, G.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 35-40, issn 0166-218XConference Paper

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errorsKUROKI, Yusuke; MATSUI, Tomomi.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2124-2135, issn 0166-218X, 12 p.Conference Paper

On some algorithmic problems regarding the hairpin completionMANEA, Florin; MARTIN-VIDE, Carlos; MITRANA, Victor et al.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2143-2152, issn 0166-218X, 10 p.Conference Paper

Enumeration of balanced ternary designsKASKI, Petteri; ÖSTERGARD, Patric R. J.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 133-141, issn 0166-218X, 9 p.Conference Paper

Bdds-design, analysis, complexity, and applicationsWEGENER, Ingo.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 229-251, issn 0166-218X, 23 p.Conference Paper

The bisection width and the isoperimetric number of arraysCEMIL AZIZOGLU, M; EGECIOGLU, Ömer.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 3-12, issn 0166-218X, 10 p.Conference Paper

Critical edges in perfect line graphs and some polyhedral consequencesWAGLER, A.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 455-466, issn 0166-218XConference Paper